undirected graph

graph, simple graph
#graph_theory

Definition

An undirected graph is a graph where relations between vertices are symmetric

$G = (V,E)$ , $G$ graph, $V$ set of vertices, and $E$ set of edges each connecting two vertices

Notes

generalization of graph is hypergraph where edge can join more than 2 vertices (i.e. edge/hyperedge is a subset of vertices)
in category theory, this category of graphs is known as SimpGph (i.e. simple graph)

References